Перевод: с английского на русский

с русского на английский

approximation parameter

См. также в других словарях:

  • Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… …   Wikipedia

  • WKB approximation — In physics, the WKB (Wentzel–Kramers–Brillouin) approximation, also known as WKBJ (Wentzel–Kramers–Brillouin–Jeffreys) approximation, is the most familiar example of a semiclassical calculation in quantum mechanics in which the wavefunction is… …   Wikipedia

  • Plasma parameter — The plasma parameter is a dimensionless number, denoted by capital Lambda, Λ, which measures the average number of electrons contained within a Debye sphere (a sphere of radius the Debye length) in a plasma (but note that the word parameter is… …   Wikipedia

  • Born-Oppenheimer-Approximation — Die Born Oppenheimer Näherung oder Born Oppenheimer Approximation oder adiabatische Näherung ist eine Methode zur Lösung der Schrödingergleichung für ein System mit mehreren schweren und wenigstens einem leichten Teilchen. Dieses Problem tritt… …   Deutsch Wikipedia

  • Van-der-Waals-Parameter — Die Van der Waals Gleichung ist eine angenäherte Zustandsgleichung für reale Gase. Sie wurde 1873 durch Johannes Diderik van der Waals aufgestellt, wofür er 1910 den Nobelpreis für Physik erhielt. Gas a in (kPa·dm6)/mol2 b in dm3/mol Helium (He)… …   Deutsch Wikipedia

  • Van der Waals Parameter — Die Van der Waals Gleichung ist eine angenäherte Zustandsgleichung für reale Gase. Sie wurde 1873 durch Johannes Diderik van der Waals aufgestellt, wofür er 1910 den Nobelpreis für Physik erhielt. Gas a in (kPa·dm6)/mol2 b in dm3/mol Helium (He)… …   Deutsch Wikipedia

  • Stationary phase approximation — In mathematics, the stationary phase approximation is a basic principle of asymptotic analysis, applying to oscillatory integrals taken over n dimensional space Rn where i is the imaginary unit. Here f and g are real valued smooth functions. The… …   Wikipedia

  • K-set (geometry) — In discrete geometry, a k set of a finite point set S in the Euclidean plane is a subset of k elements of S that can be strictly separated from the remaining points by a line. More generally, in Euclidean space of higher dimensions, a k set of a… …   Wikipedia

  • Structural alignment — is a form of sequence alignment based on comparison of shape. These alignments attempt to establish equivalences between two or more polymer structures based on their shape and three dimensional conformation. This process is usually applied to… …   Wikipedia

  • Field electron emission — It is requested that a diagram or diagrams be included in this article to improve its quality. For more information, refer to discussion on this page and/or the listing at Wikipedia:Requested images. Field emission (FE) (also known as field… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»